Communication-aware Fault-tolerant Scheduling Strategy for Precedence Constrained Tasks in Heterogeneous Distributed Systems
نویسندگان
چکیده
Abstract Fault-tolerant scheduling is an important issue for optimal heterogeneous distributed systems because of a wide range of resource failures. Primary-backup approach is a common methodology used for fault tolerance wherein each task has a primary copy and a backup copy on two different processors. For independent tasks, the backup copy can overload with other backup copies on the same processor, as long as their corresponding primary copies are scheduled on different processors. Unfortunately, most of the scheduling algorithms developed on a simple model where communication contention is not taken into account. In this paper we proposed a improve list scheduling algorithm, called heterogeneous communication-aware fault-tolerant scheduling (HCFS). The new approach for computing task priority is proposed which considers the performance difference in heterogeneous systems. Simulation results show that compared with existing scheduling algorithms in the literature, our scheduling algorithm improves the reliability and performance.
منابع مشابه
A Fault-tolerant Real-time Scheduling Algorithm for Precedence-Constrained Tasks in Distributed Heterogeneous Systems
متن کامل
Green Energy-aware task scheduling using the DVFS technique in Cloud Computing
Nowdays, energy consumption as a critical issue in distributed computing systems with high performance has become so green computing tries to energy consumption, carbon footprint and CO2 emissions in high performance computing systems (HPCs) such as clusters, Grid and Cloud that a large number of parallel. Reducing energy consumption for high end computing can bring various benefits such as red...
متن کاملReal-time Fault-tolerant Scheduling Algorithm for Distributed Computing Systems
This article proposes a Distributed Realtime Fault-tolerant model, priority Real-time Fault-tolerant algorithm and computational architecture of Distributed Real-time Fault-tolerant. According to this model, the problem of how to schedule a weighted Directed Acyclic Graph (DAG) in Distributed computing system for high reliability can be solved in the presence of multiprocessors faults. When som...
متن کاملAn Effective Bi-Criteria and Contention Awareness Scheduling in Heterogeneous Distributed Systems
Fault-tolerant scheduling is an important issue for optimal heterogeneous distributed systems because of a wide range of resource failures. In this paper we propose a fault-tolerant scheduling heuristics for precedence task that is based on primary-backup replication scheme on a realistic platform model where communication contention is taken into account. We focus on a bi-criteria approach, wh...
متن کاملA novel fault-tolerant scheduling algorithm for precedence constrained tasks in real-time heterogeneous systems
Fault tolerance is an essential requirement for real-time systems, due to the potentially catastrophic consequences of faults. In this paper, we investigate an efficient off-line scheduling algorithm in which real-time tasks with precedence constraints can tolerate one processor's permanent failure in a heterogeneous system with fully connected network. The tasks are assumed to be non-preemptab...
متن کامل